Integer Network Synthesis Problem for Hop Constrained Flows
نویسنده
چکیده
Hop constraint is associated with modern communication network flows. We consider the problem of designing an optimal undirected network with integer-valued edge-capacities that meets a given set of single-commodity, hop-constrained network flow value requirements. We present a strongly polynomial, combinatorial algorithm for the problem with value of hop-parameter equal to three when values of flow requirements are sufficiently large.
منابع مشابه
ROBUST RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH UNCERTAIN-BUT-BOUNDED ACTIVITY DURATIONS AND CASH FLOWS I. A NEW SAMPLING-BASED HYBRID PRIMARY-SECONDARY CRITERIA APPROACH
This paper, we presents a new primary-secondary-criteria scheduling model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations (UD) and cash flows (UC). The RCPSP-UD-UC approach producing a “robust” resource-feasible schedule immunized against uncertainties in the activity durations and which is on the sampling-based scenarios may be evaluated from a cos...
متن کاملA multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
Genetic algorithms and other evolutionary algorithms have been successfully applied to solve constrained minimum spanning tree problems in a variety of communication network design problems. In this paper we enlarge the application of these types of algorithms by presenting a multi-population hybrid genetic algorithm to another communication design problem. This new problem is modeled through a...
متن کاملOn the Hop Constrained Steiner Tree Problem with Multiple Root Nodes
We consider a new network design problem that generalizes the Hop and Diameter Constrained Minimum Spanning and Steiner Tree Problem as follows: given an edge-weighted undirected graph whose nodes are partitioned into a set of root nodes, a set of terminals and a set of potential Steiner nodes, find a minimum-weight subtree that spans all the roots and terminals so that the number of hops betwe...
متن کاملHop Constrained Connected Facility Location: A Hierarchy of Formulations
Connected Facility Location (ConFL) is a problem that combines network design and facility location aspects: given a set of customers, a set of potential facility locations and some inter-connection nodes, ConFL searches for the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The costs needed for building the Stein...
متن کاملInteger programming formulations for the k-edge-connected 3-hop-constrained network design problem
In this paper, we study the k edge-connected L-hop-constrained network design problem. Given a weighted graph G = (V,E), a set D of pairs of nodes, two integers L ≥ 2 and k ≥ 2, the problem consists in finding a minimum weight subgraph of G containing at least k edge-disjoint paths of length at most L between every pairs {s, t} ∈ D. We consider the problem in the case where L = 2, 3 and |D| ≥ 2...
متن کامل